G.E. Moore on logical possibility
نویسندگان
چکیده
منابع مشابه
Novel Si-Ge-C Superlattices for “More than Moore” CMOS
The search for Silicon-based direct band-gap semiconductors is more relevant than ever for “More than Moore” CMOS. Monolithically-integrated novel crystalline materials are key to enabling increased performance and new functionalities, such as efficient light absorption and emission. Si-Ge-C SuperLattices [1] are highly ordered synthetic crystals having direct band-gaps and large oscillator str...
متن کاملThe Access Problem and Knowledge of Logical Possibility
Accepting truth-value realism can seem to raise an explanatory problem: what can explain our accuracy about mathematics, i.e., the match between human psychology and objective mathematical facts? A range of current truth-value realist philosophies of mathematics allow one to reduce this access problem to a problem of explaining our accuracy about which mathematical practices are coherent – in a...
متن کاملA duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملOn Moore bipartite digraphs
In the context of the degree/diameter problem for directed graphs, it is known that the number of vertices of a strongly connected bipartite digraph satisfies a Moore-like bound in terms of its diameter k and the maximum out-degrees (d1; d2) of its partite sets of vertices. It has been proved that, when d1d2 > 1, the digraphs attaining such a bound, called Moore bipartite digraphs, only exist w...
متن کاملOn Boyer-Moore Preprocessing
Probably the two best-known exact string matching algorithms are the linear-time algorithm of Knuth, Morris and Pratt (KMP), and the fast on average algorithm of Boyer and Moore (BM). The efficiency of these algorithms is based on using a suitable failure function. When a mismatch occurs in the currently inspected text position, the purpose of a failure function is to tell how many positions th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic and Logical Philosophy
سال: 2004
ISSN: 2300-9802,1425-3305
DOI: 10.12775/llp.2002.001